package com.example.demo.his.leetcode;

/**
 * @auther zzc
 * @date 2021/4/6 9:15
 */
public class 二的幂 {

    public boolean solution(int n) {
        if (n == 0) return false;
        long x = (long) n;
        return (x & (x - 1)) == 0;
    }
}
